Visibility Graphs of Towers
نویسندگان
چکیده
A tower is a polygon consisting of two reflex chains sharing one common endpoint, together with one edge joining the other endpoints of the chains. A linear time algorithm is given to recognize the [vertex] visibility graphs of towers, and these graphs are characterized as bipartite permutation graphs with an added Hamiltonian cycle. Similar results have been obtained independently by Choi, Shin and Chwa (1992).
منابع مشابه
Determining the Spatial Location of Lookout Towers in Rapid Forest Fire Detection Using Geographic Information System (GIS)
Degradation of forests by fire has several environmental and socio-economic impacts and causes a disruption in the balance of ecosystems. Thus, rapid identification of fire using fires detection towers is necessary to reduce destructive effects in forests. Therefore, the purpose of this study is the identification of best and optimal locations to install fire detection towers using Digital Elev...
متن کاملFurther results on arc and bar k-visibility graphs
We consider visibility graphs involving bars and arcs in which lines of sight can pass through at most k objects. We prove a new edge bound for arc k-visibility graphs, provide maximal constructions for arc visibility graphs and semi-arc k-visibility graphs, and give a complete characterization of semi-arc visibility graphs. We further show that the family of arc i-visibility graphs is never co...
متن کاملOn Visibility Graphs — Upper Bounds and Classification of Special Types
We examine several types of visibility graphs: bar and semi-bar k-visibility graphs, rectangle k-visibility graphs, arc and circle k-visibility graphs, and compact visibility graphs. We improve the upper bound on the thickness of bar k-visibility graphs from 2k(9k − 1) to 6k, and prove that the upper bound must be at least k + 1. We also show that the upper bound on the thickness of semi-bar k-...
متن کاملSchreier Spectrum of the Hanoi Towers Group on Three Pegs
Finite dimensional representations of the Hanoi Towers group are used to calculate the spectra of the finite graphs associated to the Hanoi Towers Game on three pegs (the group serves as a renorm group for the game). These graphs are Schreier graphs of the action of the Hanoi Towers group on the levels of the rooted ternary tree. The spectrum of the limiting graph (Schreir graph of the action o...
متن کاملEdge N-Level Sparse Visibility Graphs: Fast Optimal Any-Angle Pathfinding Using Hierarchical Taut Paths
In the Any-Angle Pathfinding problem, the goal is to find the shortest path between a pair of vertices on a uniform square grid, that is not constrained to any fixed number of possible directions over the grid. Visibility Graphs are a known optimal algorithm for solving the problem with the use of preprocessing. However, Visibility Graphs are known to perform poorly in terms of running time, es...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comput. Geom.
دوره 7 شماره
صفحات -
تاریخ انتشار 1997